On the generalized constrained longest common subsequence problemsCHEN, Yi-Ching; CHAO, Kun-Mao.Journal of combinatorial optimization. 2011, Vol 21, Num 3, pp 383-392, issn 1382-6905, 10 p.Article

A new efficient data cleansing methodLI ZHAO; SUNG SAM YUAN; SUN PENG et al.Lecture notes in computer science. 2002, pp 484-493, issn 0302-9743, isbn 3-540-44126-3, 10 p.Conference Paper

Speeding up transposition-invariant string matchingDEOROWICZ, Sebastian.Information processing letters. 2006, Vol 100, Num 1, pp 14-20, issn 0020-0190, 7 p.Article

Approximate matching of run-length compressed stringsMÄKINEN, Veli; NAVARRO, Gonzalo; UKKONEN, Esko et al.Algorithmica. 2003, Vol 35, Num 4, pp 347-369, issn 0178-4617, 23 p.Article

Dynamic programming algorithms for the mosaic longest common subsequence problemHUANG, Kuo-Si; YANG, Chang-Biau; TSENG, Kuo-Tsung et al.Information processing letters. 2007, Vol 102, Num 2-3, pp 99-103, issn 0020-0190, 5 p.Article

A coarse-grained parallel algorithm for the all-substrings longest common subsequence problemALVES, Carlos E. R; CACERES, Edson N; SIANG WUN SONG et al.Algorithmica. 2006, Vol 45, Num 3, pp 301-335, issn 0178-4617, 35 p.Article

Remark on the Hsu-Du new algorithm for the longest common subsequence problemAPOSTOLICO, A.Information processing letters. 1987, Vol 25, Num 4, pp 235-236, issn 0020-0190Article

A fast and practical bit-vector algorithm for the Longest Common Subsequence problemCROCHEMORE, Maxime; ILIOPOULOS, Costas S; PINZON, Yoan J et al.Information processing letters. 2001, Vol 80, Num 6, pp 279-285, issn 0020-0190Article

STANDARD DEVIATION OF THE LONGEST COMMON SUBSEQUENCELEMBER, Jüri; MATZINGER, Heinrich.Annals of probability. 2009, Vol 37, Num 3, pp 1192-1235, issn 0091-1798, 44 p.Article

New processor array architectures for the longest common subsequence problemMICHAILIDIS, Panagiotis D; MARGARITIS, Konstantinos G.Journal of supercomputing. 2005, Vol 32, Num 1, pp 51-69, issn 0920-8542, 19 p.Article

Beam search for the longest common subsequence problemBLUM, Christian; BLESA, Maria J; LOPEZ-IBANEZ, Manuel et al.Computers & operations research. 2009, Vol 36, Num 12, pp 3178-3186, issn 0305-0548, 9 p.Article

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem : Genetic and Evolutionary ComputationJANSEN, Thomas; WEYLAND, Dennis.Algorithmica. 2010, Vol 57, Num 1, pp 170-186, issn 0178-4617, 17 p.Article

On the Longest Common Rigid Subsequence ProblemBANSAL, Nikhil; LEWENSTEIN, Moshe; BIN MA et al.Algorithmica. 2010, Vol 56, Num 2, pp 270-280, issn 0178-4617, 11 p.Article

A linear space algorithm for computing a longest common increasing subsequenceSAKAI, Yoshifumi.Information processing letters. 2006, Vol 99, Num 5, pp 203-207, issn 0020-0190, 5 p.Article

A Fast Multiple Longest Common Subsequence (MLCS) AlgorithmQINGGUO WANG; KORKIN, Dmitry; YI SHANG et al.IEEE transactions on knowledge and data engineering. 2011, Vol 23, Num 3, pp 321-334, issn 1041-4347, 14 p.Article

An almost-linear time and linear space algorithm for the longest common subsequence problemGUO, J. Y; HWANG, F. K.Information processing letters. 2005, Vol 94, Num 3, pp 131-135, issn 0020-0190, 5 p.Article

Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequencesKANG NING; HOONG KEE NG; HON WAI LEONG et al.International journal of data mining and bioinformatics (Print). 2011, Vol 5, Num 6, pp 611-625, issn 1748-5673, 15 p.Article

Normalised LCS-based method for indexing multidimensional data cubeSHARMA, Mayank; RAJPAL, Navin; RAMANA REDDY, B. V et al.International journal of intelligent information and database systems (Print). 2013, Vol 7, Num 2, pp 180-204, issn 1751-5858, 25 p.Article

Sparse LCS Common Substring AlignmentLANDAU, Gad M; SCHIEBER, Baruch; ZIV-UKELSON, Michal et al.Lecture notes in computer science. 2003, pp 225-236, issn 0302-9743, isbn 3-540-40311-6, 12 p.Conference Paper

Efficient algorithms for finding a longest common increasing subsequenceCHAN, Wun-Tat; YONG ZHANG; FUNG, Stanley P. Y et al.Journal of combinatorial optimization. 2007, Vol 13, Num 3, pp 277-288, issn 1382-6905, 12 p.Article

An algorithm for matching run-length coded stringsBUNKE, H; CSIRIK, J.Computing (Wien. Print). 1993, Vol 50, Num 4, pp 297-314, issn 0010-485XArticle

All semi-local longest common subsequences in subquadratic timeTISKIN, Alexander.Lecture notes in computer science. 2006, pp 352-363, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 12 p.Conference Paper

Algorithms for Computing Variants of the Longest Common Subsequence ProblemSOHEL RAHMAN, M; ILIOPOULOS, Costas S.Lecture notes in computer science. 2006, pp 399-408, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Improved Exact Method for the Double TSP with Multiple StacksLUSBY, Richard M; LARSEN, Jesper.Networks (New York, NY). 2011, Vol 58, Num 4, pp 290-300, issn 0028-3045, 11 p.Conference Paper

Improved Bounds on the Average Length of Longest Common SubsequencesLUEKER, George S.Journal of the Association for Computing Machinery. 2009, Vol 56, Num 3, issn 0004-5411, 17:1-17:38Article